Privacy-Aware Multidimensional Indexing
نویسندگان
چکیده
Deleting data from a database system in a forensic secure environment and in a high performant way is a complex challenge. Due to redundant copies and additional information stored about data items, it is not appropriate to delete only data items themselves. Additional challenges arise when using multidimensional index structures. This is because information of data items are used to index the space. As initial result, we present different deletion levels, to overcome this challenge. Based on this classification, we analyze how data can be reconstructed from the index and modify index structures to improve privacy of data items. Second, we benchmark our index structure modifications and quantify our modifications. Our results indicate that forensic secure deletion is possible with modification of multidimensional index structures having only a small impact on computational performance, in some cases.
منابع مشابه
Preserving Data Confidentiality and Query Privacy Using KNN-R Approach
Cloud computing is one of the famous and well known technique that processes the data query efficiently. Since it is maintaining huge amount of resources, its privacy and security is an issue. Cloud service providers are not trust worthy, so data is to be secured. Whenever the data is sent to the cloud, it is encrypted because to protect the sensitive data such that query privacy and data confi...
متن کاملDesign of Policy-Aware Differentially Private Algorithms
Recent work has proposed a privacy framework, calledBlowfish, that generalizes differential privacy in order togenerate principled relaxations. Blowfish privacy defini-tions take as input an additional parameter called a policygraph, which specifies which properties about individualsshould be hidden from an adversary. An open question isto characterize when Blowfish priv...
متن کاملKANIS: Preserving k-Anonymity Over Distributed Data
In this paper we describe KANIS, a distributed system designed to preserve the privacy of multidimensional, hierarchical data that are dispersed over a network. While allowing for efficient storing, indexing and querying of the data, our system employs an adaptive scheme that automatically adjusts the level of indexing according to the privacy constrains: Efficient roll-up and drill-down operat...
متن کاملIndexing of Multidimensional Discrete Data Spaces and Hybrid Extensions
INDEXING OF MULTIDIMENSIONAL DISCRETE DATA SPACES AND HYBRID EXTENSIONS
متن کاملA Mapping Based Approach for Multidimensional Data Indexing
The most common approach to improve performance for databases is through indexing. Mapping based approach is an easy to implement paradigm for indexing multidimensional data. It does not need complicated structures or algorithms, but some transformations (mapping functions) to convert multidimensional data to one dimensional data. Then the converted data can be indexed using a robust and effici...
متن کامل